package cn.orange.ch10_dynamicprogramming;

/**
 * LC392.判断子序列
 */
public class LC392 {
    public boolean isSubsequence(String s, String t) {
        int m = s.length();
        int n = t.length();
        //dp[i][j]:以i-1的s和以j-1结尾的t的最长公共子序列长度为dp[i][j]
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (s.charAt(i - 1) == t.charAt(j - 1)) {
                    dp[i][j] = 1 + dp[i - 1][j - 1];
                } else {
                    dp[i][j] = dp[i][j - 1];
                }
            }
        }
        return dp[m][n] == m;
    }

    public static void main(String[] args) {
        LC392 alg = new LC392();
        System.out.println(alg.isSubsequence("abc", "ahbgdc"));
        System.out.println(alg.isSubsequence("axc", "ahbgdc"));
    }
}
